Eigenpolytopes of Distance Regular Graphs
نویسنده
چکیده
Let X be a graph with vertex set V and let A be its adjacency matrix. If E is the matrix representing orthogonal projection onto an eigenspace of A with dimension m, then E is positive semi-deenite. Hence it is the Gram matrix of a set of jV j vectors in R m. We call the convex hull of a such a set of vectors an eigenpolytope of X. The connection between the properties of this polytope and the graph is strongest when X is distance regular and, in this case, it is most natural to consider the eigenpolytope associated to the second largest eigenvalue of A. The main result of this paper is the characterisation of those distance regular graphs X for which the 1-skeleton of this eigenpolytope is isomorphic to X.
منابع مشابه
D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملDistance-Balanced Closure of Some Graphs
In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.
متن کاملPartially Distance-regular Graphs and Partially Walk-regular Graphs∗
We study partially distance-regular graphs and partially walkregular graphs as generalizations of distance-regular graphs and walkregular graphs respectively. We conclude that the partially distanceregular graphs can be viewed as some extremal graphs of partially walk-regular graphs. In the special case that the graph is assumed to be regular with four distinct eigenvalues, a well known class o...
متن کاملThe metric dimension of small distance-regular and strongly regular graphs
A resolving set for a graph Γ is a collection of vertices S, chosen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension of Γ is the smallest size of a resolving set for Γ. A graph is distance-regular if, for any two vertices u, v at each distance i, the number of neighbours of v at each possible distance from u (i.e. i−1, i or i...
متن کاملDistance-Regular Graphs with Strongly Regular Subconstituents
In [3] Cameron et al. classified strongly regular graphs with strongly regular subconstituents. Here we prove a theorem which implies that distance-regular graphs with strongly regular subconstituents are precisely the Taylor graphs and graphs with a1 = 0 and ai ∈ {0, 1} for i = 2, . . . , d .
متن کامل